Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields
نویسنده
چکیده
II
منابع مشابه
Scalar Multiplication on Pairing Friendly Elliptic Curves
Efficient computation of elliptic curve scalar multiplication has been a significant problem since Koblitz [13] and Miller [14] independently proposed elliptic curve cryptography, and several efficient methods of scalar multiplication have been proposed (e.g., [8], [9], [12]). A standard approach for computing scalar multiplication is to use the Frobenius endomorphism. If we compute the s-multi...
متن کاملEfficient Side-channel Aware Elliptic Curve Cryptosystems over Prime Fields
Elliptic Curve Cryptosystems (ECCs) are utilized as an alternative to traditional publickey cryptosystems, and are more suitable for resource limited environments due to smaller parameter size. In this dissertation we carry out a thorough investigation of side-channel attack aware ECC implementations over finite fields of prime characteristic including the recently introduced Edwards formulatio...
متن کاملEfficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields
Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investigation of side-channel attack aware ECC implementations over finite fields of prime characteristic including the recently introduced Edwards fo...
متن کاملSPA Resistant Scalar Multiplication using Golden Ratio Addition Chain Method
In this paper we propose an efficient and secure (SPA resistant) elliptic curve scalar multiplication algorithm over odd prime fields. For this purpose, we propose an explicit algorithm for short addition-subtraction chain method which utilizes a golden ratio. We term it as golden ratio addition chain method or GRAC method in short. Our proposed scalar multiplication algorithm based over GRAC m...
متن کاملFast Elliptic Curve Multiplications Resistant against Side Channel Attacks
This paper proposes fast elliptic curve multiplication algorithms resistant against side channel attacks, based on the Montgomerytype scalar multiplication. The proposed scalar multiplications can be applied to all curves over prime fields, e.g., any standardized curves over finite fields with characteristic larger than 3. The method utilizes the addition formulas xECDBL and xECADD assembled by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008